Advanced Algorithms December 23 , 2004 Lecture 20 : LT Codes Lecturer : Amin

نویسنده

  • Randhir Singh
چکیده

Random linear fountain codes were introduced in the last lecture as a sparse-graph codes for channels with erasure. It turned out that their encoding and decoding costs were quadratic and cubic in the number of packets encoded. We study Luby Transform (LT) codes in this lecture, pioneered by Michael Luby, that retains the good performance of random linear fountain code, while drastically reducing the encoding and decoding complexities.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Advanced Topics in Cryptography April 22 , 2004 Lecture 23 Lecturer : Jonathan Katz Scribe ( s ) : Nicholas Sze

We showed previously a zero-knowledge proof system for 3-colorability. Unfortunately, to achieve negligible soundness error while maintaining zero knowledge it was required to repeat the basic, 3-round protocol sequentially polynomially-many times (giving a protocol with polynomial round complexity). Here, we show a constant-round zero-knowledge proof system for NP . We will also discuss the no...

متن کامل

Gromov–Witten invariants and quantum cohomology

This article is an elaboration of a talk given at an international conference on Operator Theory, Quantum Probability, and Noncommutative Geometry held during December 20–23, 2004, at the Indian Statistical Institute, Kolkata. The lecture was meant for a general audience, and also prospective research students, the idea of the quantum cohomology based on the Gromov–Witten invariants. Of course ...

متن کامل

Universal Source Codes Lecturer : Himanshu Tyagi Scribe : Sandip Sinha

• Huffman Code (optimal prefix-free code) • Shannon-Fano code • Shannon-Fano-Elias code • Arithmetic code (can handle a sequence of symbols) In general, the first three codes do not achieve the optimal rate H(X), and there are no immediate extensions of these codes to rate-optimal codes for a sequence of symbols. On the other hand, arithmetic coding is rate-optimal. However, all these schemes a...

متن کامل

Gesture and right hemisphere involvement in evaluating lecture material

This study investigated hemispheric lateralization in comprehending and evaluating lecture material with and without nonverbal hand gestures. Participants watched a lecture with and without gesture under conditions of cognitive load in the left or right hemisphere. There were no effects of gesture or load on lecture comprehension, but gesture and load influenced how participants evaluated the l...

متن کامل

Lecture 14 Lecturer :

In this lecture, we will observe a simple connection between query release and agnostic learning, and interpret this connection as bad news for the problem of designing efficient non-interactive private query release algorithms – at least of the type that we have been considering so far. Lets first introduce the problem of agnostic learning, and informally recall some results from learning theory.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004